Zonotopes with Large 2D-Cuts
نویسندگان
چکیده
There are d-dimensional zonotopes with n zones for which a 2-dimensional central section has Ω(nd−1) vertices. For d = 3 this was known, with examples provided by the “Ukrainian easter eggs” by Eppstein et al. Our result is asymptotically optimal for all fixed d ≥ 2.
منابع مشابه
Domain Decomposition Methods with Graph Cuts Algorithms for Image Segmentation
Recently, it is shown that graph cuts algorithms can be used to solve some variational image restoration problems, especially connected with noise removal and segmentation. For very large size images, the usage for memory and computation increases dramatically. We propose a domain decomposition method with graph cuts algorithms. We show that the new approach costs effective both for memory and ...
متن کاملComputerized treatment planning in radiation therapy of intact breast: influence of number of CT-cuts.
PURPOSE To compare the accuracy of 2D algorithm with an established 3D algorithm, and to define the number of CT-slices needed for treatment planning of intact breast irradiation. MATERIAL AND METHODS Twenty patients with breast cancer treated with conservative surgery were included in this study, ten of them had right breast cancer and the other 10 patients had cancer of the left breast. For...
متن کاملComputing Reachable Sets of Hybrid Systems Using a Combination of Zonotopes and Polytopes
The computation of reachable sets for hybrid systems with linear continuous dynamics is addressed. Zonotopes are used for the representation of reachable sets, resulting in an algorithm with low computational complexity with respect to the dimension of the considered system. However, zonotopes have drawbacks when being intersected with transition guards which determine the discrete behavior of ...
متن کاملFast 4D segmentation of large datasets using graph cuts
In this paper, we propose to use 4D graph cuts for the segmentation of large spatio-temporal (4D) datasets. Indeed, as 4D datasets grow in popularity in many clinical areas, so will the demand for efficient general segmentation algorithms. The graph cuts method has become a leading method for complex 2D and 3D image segmentation in many applications. Despite a few attempts in 4D, the use of gra...
متن کاملTwo dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
In this paper, we study the relationship between 2D lattice-free cuts, the family of cuts obtained by taking two-row relaxations of a mixed-integer program (MIP) and applying intersection cuts based on maximal lattice-free sets in R, and various types of disjunctions. Recently, Li and Richard (2007) studied disjunctive cuts obtained from t-branch split disjunctions of mixed-integer sets (these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 42 شماره
صفحات -
تاریخ انتشار 2009